{0,2}-Degree free spanning forests in graphs
نویسندگان
چکیده
منابع مشابه
{0, 2}-Degree free spanning forests in graphs
Let G be a graph and S be a set of non-negative integers. By an S-degree free spanning forest of G we mean a spanning forest of G with no vertex degree in S. In this paper we study the existence of {0, 2}-degree free spanning forests in graphs. We show that if G is a graph with minimum degree at least 4, then there exists an {0, 2}-degree free spanning forest. Moreover, we show that every 2-con...
متن کاملMaintaining Minimum Spanning Forests in Dynamic Graphs
We present the first fully dynamic algorithm for maintaining a minimum spanning forest in time o( √ n) per operation. To be precise, the algorithm uses O(n1/3 logn) amortized time per update operation. The algorithm is fairly simple and deterministic. An immediate consequence is the first fully dynamic deterministic algorithm for maintaining connectivity and bipartiteness in amortized time O(n1...
متن کاملDegree conditions for forests in graphs
IfH is any forest of order nwithm edges, then any graphG of order nwith d(u)+d(v) 2m−1 for any two non-adjacent vertices u, v contains H.
متن کاملSpanning Trees of Bounded Degree Graphs
We consider lower bounds on the number of spanning trees of connected graphs with degree bounded by d. The question is of interest because such bounds may improve the analysis of the improvement produced by memorisation in the runtime of exponential algorithms. The value of interest is the constant βd such that all connected graphs with degree bound ed by d have at least β d spanning trees wher...
متن کاملSpanning k-Forests with Large Components in K1, k+1-Free Graphs
For an integer k with k ≥ 2, a k-tree (resp. a k-forest) is a tree (resp. forest) with maximum degree at most k. In this paper, we show that for any integer k with k ≥ 3, any connected K1,k+1-free graph has a spanning k-tree or a spanning k-forest with only large components.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2015
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.01.034